Programmed Grammars with Rule Queues
نویسنده
چکیده
We generalise the well-known notion of programmed grammars without appearance checking by introducing a buffer that could store sequences of rules, thus not necessarily describing the rule to be selected in the very next step, but rather in some future time.
منابع مشابه
The Power of Programmed Grammars with Graphs from Various Classes
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain th...
متن کاملOn Restricted Context-Free Grammars
Context-free grammars are widely used for the simple form of their rules. A derivation step consists of the choice of a nonterminal of the sentential form and of an application of a rule rewriting it. Several regulations of the derivation process have been studied to increase the power of context-free grammars. In the resulting grammars, however, not only the symbols to be rewritten are restric...
متن کاملAccepting Grammars and Systems
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be j...
متن کاملRegulated Finite Index Language Families Collapse
We prove normal form theorems for programmed, ordered, and random context, context-free grammars as well as context-free grammars with regular context conditions of nite index. Based on these normal forms, we reprove that the family of programmed, ordered , permitting, and forbidding random context context-free languages of nite index coincide, regardless whether erasing productions, i.e., rule...
متن کاملProgrammed Graph Replacement Systems
Various forms of programmed graph replacement systems as extensions of context-sensitive graph replacement systems have been proposed until today. They diier considerably with respect to their underlying graph models, the supported forms of graph replacement rules, and ooered rule regulation mechanisms. Some of them have additional constructs for the deenition of graph schemata, derived graph p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 18 شماره
صفحات -
تاریخ انتشار 2007